Die Concomitanten der tern�ren cubischen Formen, insbesondere der Formx 1 x 3 2 ?4x 2 3 +g 2 x 1 2 x 2+g 3 x 1 3

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Note on Twists of (y^2=x^3+1)

‎‎In the category of Mordell curves (E_D:y^2=x^3+D) with nontrivial torsion groups we find curves of the generic rank two as quadratic twists of (E_1), ‎and of the generic rank at least two and at least three as cubic twists of (E_1). ‎Previous work‎, ‎in the category of Mordell curves with trivial torsion groups‎, ‎has found infinitely many elliptic curves with ...

متن کامل

a note on twists of (y^2=x^3+1)

‎‎in the category of mordell curves (e_d:y^2=x^3+d) with nontrivial torsion groups we find curves of the generic rank two as quadratic twists of (e_1), ‎and of the generic rank at least two and at least three as cubic twists of (e_1). ‎previous work‎, ‎in the category of mordell curves with trivial torsion groups‎, ‎has found infinitely many elliptic curves with rank at least seven as sextic tw...

متن کامل

Hyperbolicity of the family $f_c(x)=c(x-frac{x^3}{3})$

The aim of this paper is to present a proof of the hyperbolicity of the family $f_c(x)=c(x-frac{x^3}{3}), |c|>3$, on an its invariant subset of $mathbb{R}$.

متن کامل

بررسی فازی ترکیبات Mo + 2(1 - x) Si + 2xAl

X-ray powder diffraction data for Mo2.85Al1.91Si4.81 are presented here. The new Mo2.85Al1.91Si4.81 compound was successfully prepared, using the self-propagating high-temperature synthesis (SHS) technique. The starting atomic mixture of reactant powders was Mo + 2(1 - x)Si + 2xAl with 0.2 ≤ x ≤ 0.5. The final powder compound obtained by the SHS technique was determined to be in x = 0.2; Mo(Si,...

متن کامل

2 3 1 1 1 0 0 0 0 1 1 1 2 3 1 2 3 1 3 2 2 3 Adjacency matrix Adjacency list

Graphs and Digraphs: A graph G = (V,E) is a structure that represents a discrete set V objects, called vertices or nodes, and a set of pairwise relations E between these objects, called edges. Edges may be directed from one vertex to another or may be undirected. The term “graph” means an undirected graph, and directed graphs are often called digraphs (see Fig. 1). Graphs and digraphs provide a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematische Annalen

سال: 1888

ISSN: 0025-5831,1432-1807

DOI: 10.1007/bf01211898